Data Cube : A relational Aggregation Operator
نویسنده
چکیده
Many scientific computing tasks are too large to be processed quickly on one computer. Instead, the grid has become popular for a wide range of disciplines. Efficiently using the all the resources of the grid is a challenging, NP problem though. The authors introduced a new method for scheduling that accounted for data dependencies, a topic often ignored in job scheduling algorithms. They also analyzed the method extensively, in terms of tasks that were compute bound, data bound and tasks where job completion was estimated incorrectly.
منابع مشابه
The MD-join: An Operator for Complex OLAP
OLAP queries (i.e. group-by or cube-by queries with aggregation) have proven to be valuable for data analysis and exploration. Many decision support applications need very complex OLAP queries, requiring a fine degree of control over both the group definition and the aggregates that are computed. For example, suppose that the user has access to a data cube whose measure attribute is Sum(Sales)....
متن کاملConstructing Object Oriented Class for extracting and using data from data cube
The goal of this article is to depict Object Oriented Conceptual Model Data Cube using it as an example. In short, the paper has described: 1) Structural level in object oriented class definition of data cube; 2) The basic methods for computing data cube from relational database by select operator; 3) To set tasks for future work to develop appropriate methods of class to construct data cube in...
متن کاملCube : A relational Aggregation Operator
Many scientific computing tasks are too large to be processed quickly on one computer. Instead, the grid has become popular for a wide range of disciplines. Efficiently using the all the resources of the grid is a challenging, NP problem though. The authors introduced a new method for scheduling that accounted for data dependencies, a topic often ignored in job scheduling algorithms. They also ...
متن کاملIncremental Aggregation on MOLAP Cube Based on n-Dimensional Extendible Karnaugh Arrays
Data is increasing so rapidly that new data warehousing approaches are required to process and analyze data. Aggregation of data incrementally is needed to fast access of data and compute aggregation functions. Multidimensional arrays are generally used for this purpose. But some disadvantages such as address space requirement is large and processing time is comparatively slow in case of aggreg...
متن کاملMultidimensional cyclic graph approach: Representing a data cube without common sub-graphs
We present a new full cube computation technique and a cube storage representation approach, called the multidimensional cyclic graph (MCG) approach. The data cube relational operator has exponential complexity and therefore its materialization involves both a huge amount of memory and a substantial amount of time. Reducing the size of data cubes, without a loss of generality, thus becomes a fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015